Sparse Spatial Selection for Novelty-Based Search Result Diversification
نویسندگان
چکیده
Novelty-based diversification approaches aim to produce a diverse ranking by directly comparing the retrieved documents. However, since such approaches are typically greedy, they require O(n) documentdocument comparisons in order to diversify a ranking of n documents. In this work, we propose to model novelty-based diversification as a similarity search in a sparse metric space. In particular, we exploit the triangle inequality property of metric spaces in order to drastically reduce the number of required document-document comparisons. Thorough experiments using three TREC test collections show that our approach is at least as effective as existing novelty-based diversification approaches, while improving their efficiency by an order of magnitude.
منابع مشابه
Modelling efficient novelty-based search result diversification in metric spaces
a r t i c l e i n f o a b s t r a c t Novelty-based diversification provides a way to tackle ambiguous queries by re-ranking a set of retrieved documents. Current approaches are typically greedy, requiring O (n 2) document–document comparisons in order to diversify a ranking of n documents. In this article, we introduce a new approach for novelty-based search result diversification to reduce th...
متن کاملA Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملNovelty and Adaptive Novelty
In this paper we briefly describe Novelty and Adaptive Novelty, two high-performance, stochastic local search (SLS) algorithms for SAT. Based on the WalkSAT architecture, these algorithms combine search intensification and diversification feautures that lead to good peformance on a broad range of SAT instances. The performance of the Novelty algorithm critically depends on the setting of a soca...
متن کاملAdaptive Novelty
In this paper we briefly describe Novelty and Adaptive Novelty, two high-performance, stochastic local search (SLS) algorithms for SAT. Based on the WalkSAT architecture, these algorithms combine search intensification and diversification feautures that lead to good peformance on a broad range of SAT instances. The performance of the Novelty algorithm critically depends on the setting of a soca...
متن کاملKDEIM at NTCIR-12 IMine-2 Search Intent Mining Task: Query Understanding through Diversified Ranking of Subtopics
In this paper, we describe our participation in the Query Understanding subtask of the NTCIR-12 IMINE Task. We propose a method that extracts subtopics by leveraging the query suggestions from search engines. The importance of the subtopics with the query is estimated by exploiting multiple query-dependent and query-independent features with supervised feature selection. To diversify the subtop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011